Step of Proof: uni_sat_wf
9,38
postcript
pdf
Inference at
*
I
of proof for Lemma
uni
sat
wf
:
T
:Type,
a
:
T
,
Q
:(
T
). (
a
= !
x
:
T
.
Q
(
x
))
latex
by ((Unfold `uni_sat` 0)
CollapseTHEN ((Auto_aux (first_nat 1:n) ((first_nat 1:n),(first_nat 3:n
C
)) (first_tok :t) inil_term)))
latex
C
.
Definitions
P
Q
,
P
Q
,
x
(
s
)
,
a
= !
x
:
T
.
Q
(
x
)
,
t
T
,
,
x
:
A
.
B
(
x
)
origin